The use of non-commutative algebra in cryptographically secure pseudo-random number generators

نویسندگان

  • Brian M. McKeever
  • Brian McKeever
چکیده

This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis provides a description of the performance of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptographically Secure Linear feedback shift

ISSN: 2278 – 1323 All Rights Reserved © 2014 IJARCET 3504  Abstract— True random bit generator requires a naturally occurring source of randomness. Designing a hardware device or software program to exploit this randomness and produce a bit sequence that is free of biases and correlation is difficult task. For most cryptographic applications, the generator must not be subject to observation or...

متن کامل

Fast and Reliable Random Number Generators

Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...

متن کامل

Fast and Reliable Random Number Generators for Scientific Computing

Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...

متن کامل

Chaos-based Pseudo-Random Number Generators and Chip Implementation

Cryptography as an ancient subject is endowed with new vigor by chaos theory. Cryptography protects the security of today’s ubiquitous Internet communication, which as an open network is vulnerable to attack. In this paper, chaos-based cryptography is surveyed with focus on designing chaotic pseudo-random number generators (CPRNGs) for stream cipher and their chip implementation. The properties...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014